Directed acyclic graph

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling).

Directed acyclic graphs are sometimes instead called acyclic directed graphs^[1] or acyclic digraphs.^[2]

^ Cite error: The named reference thul was invoked but never defined (see the help page).
^ Cite error: The named reference bang was invoked but never defined (see the help page).

[thul-1] Cite error: The named reference thul was invoked but never defined (see the help page).

[bang-2] Cite error: The named reference bang was invoked but never defined (see the help page).

[1]

[2]